Quantum coin flipping, qubit measurement, and generalized Fibonacci numbers
نویسندگان
چکیده
The problem of Hadamard quantum coin measurement in $n$ trials, with arbitrary number repeated consecutive last states is formulated terms Fibonacci sequences for duplicated states, Tribonacci numbers triplicated and $N$-Bonacci $N$-plicated states. probability formulas position are derived Lucas numbers. For generic qubit coin, the expressed by more general, polynomials probabilities. generating function probabilities, Golden Ratio limit these probabilities Shannon entropy corresponding determined. By generalized Born rule universality $n$-qubit gate, we formulate construct projection operators Hilbert space, constrained on tree results to qutrit qudit coins, described Fibonacci-$N$-Bonacci sequences.
منابع مشابه
Quantum-Secure Coin-Flipping and Applications
In this paper, we prove classical coin-flipping secure in the presence of quantum adversaries. The proof uses a recent result of Watrous [20] that allows quantum rewinding for protocols of a certain form. We then discuss two applications. First, the combination of coin-flipping with any non-interactive zero-knowledge protocol leads to an easy transformation from non-interactive zero-knowledge t...
متن کاملRestricted Permutations, Fibonacci Numbers, and k-generalized Fibonacci Numbers
In 1985 Simion and Schmidt showed that the number of permutations in Sn which avoid 132, 213, and 123 is equal to the Fibonacci number Fn+1. We use generating function and bijective techniques to give other sets of pattern-avoiding permutations which can be enumerated in terms of Fibonacci or k-generalized Fibonacci numbers.
متن کاملGENERALIZED q - FIBONACCI NUMBERS
We introduce two sets of permutations of {1, 2, . . . , n} whose cardinalities are generalized Fibonacci numbers. Then we introduce the generalized q-Fibonacci polynomials and the generalized q-Fibonacci numbers (of first and second kind) by means of the major index statistic on the introduced sets of permutations.
متن کاملOn bit-commitment based quantum coin flipping
In this paper, we focus on a special framework for quantum coin flipping protocols, bit-commitment based protocols, within which almost all known protocols fit. We show a lower bound of 1/16 for the bias in any such protocol. We also analyse a sequence of multi-round protocol that tries to overcome the drawbacks of the previously proposed protocols, in order to lower the bias. We show an intric...
متن کاملExperimental loss-tolerant quantum coin flipping
Coin flipping is a cryptographic primitive in which two distrustful parties wish to generate a random bit to choose between two alternatives. This task is impossible to realize when it relies solely on the asynchronous exchange of classical bits: one dishonest player has complete control over the final outcome. It is only when coin flipping is supplemented with quantum communication that this p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical and Mathematical Physics
سال: 2021
ISSN: ['1864-5887', '1864-5879']
DOI: https://doi.org/10.1134/s0040577921080079